Parallel and Sequential Independence for Borrowed Contexts

Parallel and sequential independence are central concepts in the concurrency theory of the double pushout (dpo) approach to graph rewriting. However, so far those same notions were missing for dpo rewriting extended with borrowed contexts (dpobc), a formalism used for equipping dpo derivations with labels and introduced for modeling open systems that interact with the environment. In this work we propose the definition of parallel and sequential independence for dpobc rewriting, and we prove that these novel notions allow generalizing the Church-Rosser and parallelism theorems holding for dpo rewriting. Most importantly, we show that the dpobc version of these theorems still guarantees the local confluence and the parallel execution of pairs of independent dpobc derivations.